Undecidability of Multi-modal Hybrid Logics
نویسندگان
چکیده
منابع مشابه
Undecidability of Multi-modal Hybrid Logics
This paper establishes undecidability of satisfiability for multi-modal logic equipped with the hybrid binder ↓ , with respect to frame classes over which the same language with only one modality is decidable. This is in contrast to the usual behaviour of many modal and hybrid logics, whose uni-modal and multi-modal versions do not differ in terms of decidability and, quite often, complexity. T...
متن کاملUndecidability of Relation-Changing Modal Logics
Relation-changing modal logics are extensions of the basic modal logic that allow to change the accessibility relation of a model during the evaluation of a formula. In particular, they are equipped with dynamic modalities that are able to delete, add and swap edges in the model, both locally and globally. We investigate the satisfiability problem of these logics. We define satisfiability-prese...
متن کاملSahlqvist Formulas in Hybrid Polyadic Modal Logics
Building on a new approach to polyadic modal languages and Sahlqvist formulas introduced in [10] we define Sahlqvist formulas in hybrid polyadic modal languages containing nominals and universal modality or satisfaction operators. Particularly interesting is the case of reversive polyadic languages, closed under all ‘inverses’ of polyadic modalities because the minimal valuations arising in the...
متن کاملBisimulation Quantified Logics: Undecidability
In this paper we introduce a general semantic interpretation for propositional quantification in all multi-modal logics based on bisimulations (bisimulation quantification). Bisimulation quantification has previously been considered in the context of isolated modal logics, such as PDL (D’Agostino and Hollenberg, 2000), intuitionistic logic (Pitts, 1992) and logics of knowledge (French 2003). We...
متن کاملUndecidability of Partial Order Logics
In this paper we prove the undecidability of certain temporal logics over partial orders. The proof we use is generic and can be applied to characterize various termpoal operators that cannot be used for automatic veriication (model checking). We propose that these results partially explain why the partial order model of concurrency has not gained as much popularity as the interleaving model.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2007
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2006.11.024